Certain optimality properties of the first-come first-served discipline for G/G/s queues
نویسندگان
چکیده
منابع مشابه
First Come , First Served ' can be unstable !
We consider exible manufacturing systems using thèFirst Come, First Served' (FCFS or FIFO) scheduling policy at each machine. We describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability: unboundedly growing WIP taking the form of a repeated pattern of behavior with the repetitions on an increasing scale.
متن کاملFirst-come-first-served packet dispersion and implications for TCP
We study the packet dispersion phenomenon that a traffic flow experiences when it passes through a router. We show that when there are competing flows and the router schedules packets first-come-first-served (FCFS), the dispersion is not described well by the bottleneck spacing effect. We therefore introduce the term FCFS-spacing effect. We also show that for a router implementing weighted fair...
متن کاملOptimal buffer allocation in tandems of last come first served queues
A large fixed number of buffer spaces is given. We consider the problem of allocating these spaces among the nodes of a tandem of last-come-first-served queues with general service time distributions and Poisson external arrivals so as to optimize some performance criterion associated with the time to buffer overflow, such as maximizing its mean or maximizing the probability that it exceeds som...
متن کاملSimulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms
Development of scheduling algorithms is directly related with the development of operating system which brings difficulties in implementation. Any modification on the scheduling algorithm will appear as modification on the operating system kernel code. Processor is an important source of cpu scheduling process, so it becomes very important on accomplishing of the operating system design goals. ...
متن کاملOn the throughput of degenerate intersection and first-come first-served collision resolution algorithms
Ahsrruct-It is shown that, for a ternary feedback random access channel with a Poisson arrival process, 0.5 is an upper bound to the throughput for all “degenerate intersection” algorithms (DIA’s) and firstcome first-served algorithms (FCFSA’S). As a by-product, the nested FCFSA with the largest throughput is found for the random access channel with a Bernoulli arrival process &ith parameter p....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1987
ISSN: 0304-4149
DOI: 10.1016/0304-4149(87)90208-0